A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation
نویسندگان
چکیده
We present a polynomial time approximation scheme for the real-time scheduling problem with fixed priorities when resource augmentation is allowed. For a fixed ε > 0, our algorithm computes an assignment using at most (1+ε)·OPT+1 processors in polynomial time, which is feasible if the processors have speed 1 + ε. We also show that, unless P = NP , there does not exist an asymptotic FPTAS for this problem.
منابع مشابه
Global Static-priority Scheduling of Sporadic Task Systems on Multiprocessor Platforms
The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient conditions are derived for determining whether a specified system meets all deadlines when scheduled by a static-priority algorithm. These conditions are used to obtain efficient schedulability tests for sporadic task systems scheduled using the popular Deadline-Monotonic real-time scheduling algorithm. Res...
متن کاملThe Partitioned, Static-Priority Scheduling of Sporadic Real-Time Tasks with Constrained Deadlines on Multiprocessor Platforms
We consider the partitioned scheduling of sporadic, hard-realtime tasks on a multiprocessor platform with static-priority scheduling policies. Most previous work on the static-priority scheduling of sporadic tasks upon multiprocessors has assumed implicit deadlines (i.e. a task’s relative deadline is equal to its period). We relax the equality constraint on a task’s deadline and consider task s...
متن کاملRapidSched: static scheduling and analysis for real-time CORBA
This paper presents a real-time CORBA Scheduling Service called RapidSched. RapidSched uses a global, distributed deadline monotonic priority assignment, enforcement of priorities by commercial real-time operating systems, and distributed priority ceiling resource management. RapidSched is integrated with an enhanced version of the PERTS real-time analysis tool.
متن کاملAn Evolution of Static Priority Scheduling in Real Time System
This paper reviews scheduling algorithm available in RTOS to schedule the tasks during execution in the Real Time System considering the static priority and evolution in the static priority scheduling in last decade. Real Time Operating System (RTOS) success depends on completion of task in given deadline. Real Time Operating System (RTOS) used, where we require specific application that meet t...
متن کاملRate-Based Resource Allocation Models for Embedded Systems
Run-time executives and operating system kernels for embedded systems have long relied exclusively on static priority scheduling of tasks to ensure timing constraints and other correctness conditions are met. Static priority scheduling is easy to understand and support but it suffers from a number of significant shortcomings such as the complexity of simultaneously mapping timing and importance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008